Analyzing Network Coding (Gossip) Made Easy

Network Calculus Made Easy

We deene general concepts that extend, and simplify, the network calculus developed by Cruz 1, 2, 3] for guaranteed quality of service networks. We introduce a deenition of service curve, the extended service curve, which is the same for isolated queues and for networks of queues, and makes it possible to model nodes that otherwise do not t in the calculus of Cruz. We introduce two key technica...

Radio Network Lower Bounds Made Easy

Theoreticians have studied distributed algorithms in the radio network model for close to three decades. A significant fraction of this work focuses on lower bounds for basic communication problems such as wake-up (symmetry breaking among an unknown set of nodes) and broadcast (message dissemination through an unknown network topology). In this paper, we introduce a new technique for proving th...

Analyzing Gossip in Workplace Email

We spend a significant part of our lives chatting about other people. In other words, we all gossip. Although sometimes a contentious topic, various researchers have shown gossip to be fundamental to social life—from small groups to large, formal organizations. Adopting the Enron email dataset and natural language techniques, we present the first study of gossip in a large CMC corpus. We find t...

Gossip and Random Walk Techniques for Network Coding

Ad hoc and sensor networks usually do not have a central entity for managing information spreading. Moreover, such wireless stations have limited energy and computational power. All this leads to a need for distributed and efficient algorithms for disseminating information across the network. Network coding in conjunction with random walks and gossip techniques proposes a local and distributed ...

Atom Bomb Made Easy